package com.yun.algorithmproblem.leetcodenotcomplete;

public class Leetcode3195 {

    public static void main(String[] args) {
        Leetcode3195 obj = new Leetcode3195();
        int[][] grid = {{1, 1, 1, 1}, {1, 1, 1, 1}, {1, 1, 1, 1}, {1, 1, 1, 1}};
        System.out.println(obj.minimumArea(grid));
    }

    public int minimumArea(int[][] grid) {
        return 0;
    }
}
